LassoScript Utility
Basics Browse Detail

[Map->Keys]

Tag Link [Map->Keys] Category Array
Type Member Source Available No
Support Preferred Version 6.0
Change Unchanged Data Source Any
Output Type Array Security Tag
Implementation LCAPI Sets Lasso 8.5, Lasso 8.0, Lasso 7.0, Lasso 6.0

Description

The [Map->Keys] tag returns an array of all the keys used within a map. This can be useful to determine what keys a map contains without iterating through the map to fetch each one.

If the map contains no values then an empty array is returned.

Syntax

[Map->Keys]

Parameters

No Parameters Required.

Examples

To display the names of all the keys in a map:

Use the [Map->Keys] tag. This tag returns an array that contains the names of all the keys in the map. The keys are ordered in the order they are stored in the map, not in the order they were added to the map.

[Variable: 'myMap' = (Map:
'Red'='#ff0000',
'Blue'='#0000ff',
'Green'='#00ff00'
)]
[Output: $myMap->Keys]

(Array: (Blue), (Green), (Red))

Related Tags

Category Tags

Substitution
[Array]
[Iterator]
[List]
[Pair]
[PriorityQueue]
[Queue]
[ReverseIterator]
[Series]
[Set]
[Stack]
[TreeMap]
Member
[Array->Contains]
[Array->Difference]
[Array->Find]
[Array->FindPosition]
[Array->First]
[Array->ForEach]
[Array->Get]
[Array->Insert]
[Array->InsertFirst]
[Array->InsertFrom]
[Array->InsertLast]
[Array->Intersection]
[Array->Iterator]
[Array->Join]
[Array->Last]
[Array->Merge]
[Array->Remove]
[Array->RemoveAll]
[Array->RemoveFirst]
[Array->RemoveLast]
[Array->Reserve]
[Array->Reverse]
[Array->ReverseIterator]
[Array->Second]
[Array->Size]
[Array->Sort]
[Array->SortWith]
[Array->Union]
[Iterator->AtBegin]
[Iterator->AtBottom]
[Iterator->AtEnd]
[Iterator->AtFarLeft]
[Iterator->AtFarRight]
[Iterator->AtTop]
[Iterator->Backward]
[Iterator->Down]
[Iterator->Forward]
[Iterator->InsertAtCurrent]
[Iterator->Key]
[Iterator->Left]
[Iterator->RemoveCurrent]
[Iterator->Reset]
[Iterator->Right]
[Iterator->Up]
[Iterator->Value]
[List->Contains]
[List->Difference]
[List->Find]
[List->FindPosition]
[List->First]
[List->ForEach]
[List->Get]
[List->Insert]
[List->InsertFirst]
[List->InsertFrom]
[List->InsertLast]
[List->Intersection]
[List->Iterator]
[List->Join]
[List->Last]
[List->Remove]
[List->RemoveAll]
[List->RemoveFirst]
[List->RemoveLast]
[List->Reverse]
[List->ReverseIterator]
[List->Second]
[List->Size]
[List->Sort]
[List->SortWith]
[List->Union]
[Pair->First]
[Pair->Get]
[Pair->Name]
[Pair->Second]
[Pair->Size]
[Pair->Value]
[PriorityQueue->First]
[PriorityQueue->Get]
[PriorityQueue->Insert]
[PriorityQueue->InsertLast]
[PriorityQueue->Remove]
[PriorityQueue->RemoveFirst]
[PriorityQueue->Size]
[Queue->First]
[Queue->Get]
[Queue->Insert]
[Queue->InsertLast]
[Queue->Remove]
[Queue->RemoveFirst]
[Queue->Size]
[ReverseIterator->AtBegin]
[ReverseIterator->AtBottom]
[ReverseIterator->AtEnd]
[ReverseIterator->AtFarLeft]
[ReverseIterator->AtFarRight]
[ReverseIterator->AtTop]
[ReverseIterator->Backward]
[ReverseIterator->Down]
[ReverseIterator->Forward]
[ReverseIterator->InsertAtCurrent]
[ReverseIterator->Key]
[ReverseIterator->Left]
[ReverseIterator->RemoveCurrent]
[ReverseIterator->Reset]
[ReverseIterator->Right]
[ReverseIterator->Up]
[ReverseIterator->Value]
[Set->Contains]
[Set->Difference]
[Set->Find]
[Set->ForEach]
[Set->Get]
[Set->Insert]
[Set->InsertFrom]
[Set->Intersection]
[Set->Iterator]
[Set->Join]
[Set->Remove]
[Set->RemoveAll]
[Set->ReverseIterator]
[Set->Size]
[Set->Union]
[Stack->First]
[Stack->Get]
[Stack->Insert]
[Stack->InsertFirst]
[Stack->Remove]
[Stack->RemoveFirst]
[Stack->Size]
[TreeMap->Contains]
[TreeMap->Find]
[TreeMap->Get]
[TreeMap->Insert]
[TreeMap->Insertfrom]
[TreeMap->Iterator]
[TreeMap->Keys]
[TreeMap->Remove]
[TreeMap->RemoveAll]
[TreeMap->Size]
[TreeMap->Values]